Extremal Copositive Matrices with Zero Supports of Cardinality n-2
نویسنده
چکیده
Let A ∈ Cn be an exceptional extremal copositive n × n matrix with positive diagonal. A zero u of A is a non-zero nonnegative vector such that uTAu = 0. The support of a zero u is the index set of the positive elements of u. A zero u is minimal if there is no other zero v such that supp v ⊂ suppu strictly. Let G be the graph on n vertices which has an edge (i, j) if and only if A has a zero with support {1, . . . , n} \ {i, j}. In this paper, it is shown that G cannot contain a cycle of length strictly smaller than n. As a consequence, if all minimal zeros of A have support of cardinality n − 2, then G must be the cycle graph Cn.
منابع مشابه
Erratum to: On the DJL conjecture for order 6
In this note an erratum is provided to the article “On the DJL conjecture for order 6” by Naomi Shaked-Monderer, published in Operators and Matrices 11(1), 2017, 71–88. We will demonstrate and correct two errors in this article. The first error is in the statement of a proposition, which omits a certain category of extreme matrices. The second error is in the proof of a lemma. Fortunately the l...
متن کاملIrreducible elements of the copositive cone
An element A of the n× n copositive cone C is called irreducible with respect to the nonnegative cone N if it cannot be written as a nontrivial sum A = C + N of a copositive matrix C and an elementwise nonnegative matrix N . This property was studied by Baumert [2] who gave a characterisation of irreducible matrices. We demonstrate here that Baumert’s characterisation is incorrect and give a co...
متن کاملConsidering copositivity locally
Let A be an element of the copositive cone COP. A zero u of A is a nonnegative vector whose elements sum up to one and such that uTAu = 0. The support of u is the index set suppu ⊂ {1, . . . , n} corresponding to the nonzero entries of u. A zero u of A is called minimal if there does not exist another zero v of A such that its support suppv is a strict subset of suppu. Our main result is a char...
متن کاملEla Constructing Copositive Matrices from Interior Matrices
Abstract. Let A be an n by n symmetric matrix with real entries. Using the l1-norm for vectors and letting S 1 = {x ∈ R|||x||1 = 1, x ≥ 0}, the matrix A is said to be interior if the quadratic form x Ax achieves its minimum on S 1 in the interior. Necessary and sufficient conditions are provided for a matrix to be interior. A copositive matrix is referred to as being exceptional if it is not th...
متن کاملAn LP-based Algorithm to Test Copositivity
A symmetric matrix is called copositive if it generates a quadratic form taking no negative values over the nonnegative orthant, and the linear optimization problem over the set of copositive matrices is called the copositive programming problem. Recently, many studies have been done on the copositive programming problem (see, for example, [14, 5]). Among others, several branch and bound type a...
متن کامل